Imprimitive Permutation Groups
نویسنده
چکیده
The O’Nan-Scott Theorem together with the Classification of the Finite Simple Groups is a powerful tool that give the structure of all primitive permutation groups, as well as their actions. This has allowed for the solution to many classical problems, and has opened the door to a deeper understanding of imprimitive permutation groups, as primitive permutation groups are the building blocks of imprimitive permutation groups. We first give a more or less standard introduction to imprimitive groups, and then move to less well-known techniques, with an emphasis on studying automorphism groups of graphs. A few words about these lecture notes. The lecture notes are an “expanded” version of the lecture some of the lecture will be basically exactly these lecture notes, but in many cases the proofs of some background results (typically those that in my view are those whose proofs are primarily checking certain computations) are given in these lecture notes but will not be given in the lectures due to time constraints. Also, the material is organized into sections by topic, not by lecture.
منابع مشابه
On imprimitive rank 3 permutation groups
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is achieved by first classifying imprimi...
متن کاملOrbit equivalence and permutation groups defined by unordered relations
For a set Ω an unordered relation on Ω is a family R of subsets of Ω . If R is such a relation we let G(R) be the group of all permutations on Ω that preserve R, that is g belongs to G(R) if and only if x ∈R implies x ∈R. We are interested in permutation groups which can be represented as G= G(R) for a suitable unordered relation R on Ω . When this is the case, we say that G is defined by the r...
متن کاملA note on transitive permutation groups of degree twice a prime
In this note, we consider transitive permutation groups of degree 2p, where p is an odd prime, that admit blocks of imprimitivity of size 2 but no blocks of imprimitivity of size p. Primitive permutation groups of degree twice a prime were first considered by Wielandt [6], while more recently, imprimitive permutation groups of degree twice a prime were studied by Lefèvre [2], Marušič [3], and M...
متن کاملDouble Transitivity of Galois Groups in Schubert Calculus of Grassmannians
We investigate double transitivity of Galois groups in the classical Schubert calculus on Grassmannians. We show that all Schubert problems on Grassmannians of 2and 3-planes have doubly transitive Galois groups, as do all Schubert problems involving only special Schubert conditions. We use these results to give a new proof that Schubert problems on Grassmannians of 2-planes have Galois groups t...
متن کاملFinite imprimitive linear groups of prime degree
In an earlier paper the authors have classified the nonsolvable primitive linear groups of prime degree over C. The present paper deals with the classification of the nonsolvable imprimitive linear groups of prime degree (equivalently, the irreducible monomial groups of prime degree). If G is a monomial group of prime degree r, then there is a projection π of G onto a transitive group H of perm...
متن کامل